Projection Method with Level Control in Convex Minimization
نویسندگان
چکیده
We study a projection method with level control for nonsmoooth convex minimization problems. We introduce a changeable level parameter to level control. The level estimates the minimal value of the objective function and is updated in each iteration. We analyse the convergence and estimate the efficiency of this method.
منابع مشابه
A Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملNumerical Behavior of the Method of Projection onto an Acute Cone with Level Control in Convex Minimization
We present the numerical behavior of a projection method for convex minimization problems which was studied by Cegielski [1]. The method is a modification of the Polyak subgradient projection method [6] and of variable target value subgradient method of Kim, Ahn and Cho [2]. In each iteration of the method an obtuse cone is constructed. The obtuse cone is generated by a linearly independent sys...
متن کاملStrong convergence of modified gradient-projection algorithm for constrained convex minimization problems
In this article, a modified gradient-projection algorithm (GPA) is introduced, which combines Xu’s idea of an alternative averaged mapping approach to the GPA and the general iterative method for nonexpansive mappings in Hilbert space introduced by Marino and Xu. Under suitable conditions, it is proved that the strong convergence of the sequences generated by implicit and explicit schemes to a ...
متن کاملSelection Strategies in Projection Methods for Convex Minimization Problems
We propose new projection method for nonsmooth convex minimization problems. We present some method of subgradient selection, which is based on the so called residual selection model and is a generalization of the so called obtuse cone model. We also present numerical results for some test problems and compare these results with some other convex nonsmooth minimization methods. The numerical re...
متن کاملClustering with feature selection using alternating minimization, Application to computational biology
This paper deals with unsupervised clustering with feature selection. The problem is to estimate both labels and a sparse projection matrix of weights. To address this combinatorial non-convex problem maintaining a strict control on the sparsity of the matrix of weights, we propose an alternating minimization of the Frobenius norm criterion. We provide a new efficient algorithm named K-sparse w...
متن کامل